- level of recursion
- Вычислительная техника: уровень рекурсии
Универсальный англо-русский словарь. Академик.ру. 2011.
level of recursion
Смотреть что такое "level of recursion" в других словарях:
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Recursion (computer science) — Recursion in computer science is a way of thinking about and solving problems. It is, in fact, one of the central ideas of computer science. [cite book last = Epp first = Susanna title = Discrete Mathematics with Applications year=1995… … Wikipedia
recursion theory — noun A branch of mathematical logic studying computable functions and Turing degrees, concerned with questions such as What does it mean for a function from the natural numbers to themselves to be computable? and Can noncomputable functions be… … Wiktionary
Tail recursion — In computer science, tail recursion (or tail end recursion) is a special case of recursion in which the last operation of the function is a recursive call. Such recursions can be easily transformed to iterations. Replacing recursion with… … Wikipedia
Sierpiński curve — Sierpiński curves are a recursively defined sequence of continuous closed plane fractal curves discovered by Wacław Sierpiński, which in the limit n ightarrow infty completely fill the unit square: thus their limit curve, also called the… … Wikipedia
Viable System Model — The Viable Systems Model, or VSM is a model of the organisational structure of any viable or autonomous system. A viable system is any system organised in such a way as to meet the demands of surviving in the changing environment. One of the… … Wikipedia
Kirkpatrick–Seidel algorithm — The Kirkpatrick–Seidel algorithm, called by its authors the ultimate planar convex hull algorithm is an algorithm for computing the convex hull of a set of points in the plane, with O( n log h ) time complexity, where n is the number of input… … Wikipedia
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
PSPACE-complete — Mathematicians and computer scientists try to carefully define different types of complexity, and PSPACE complete is one of these types.Roughly, PSPACE is all the problems which can be solved by programs which only need a polynomial (in the… … Wikipedia
Hilbert curve — A Hilbert curve (also known as a Hilbert space filling curve) is a continuous fractal space filling curve first described by the German mathematician David Hilbert in 1891. [D. Hilbert: Über die stetige Abbildung einer Linie auf ein Flächenstück … Wikipedia
Generalized geography — In computational complexity theory, generalized geography is a problem that can be proven to be PSPACE Complete.IntroductionGeography is a childs game, which is good for a long car trip, where players take turns naming cities from anywhere in the … Wikipedia
